Modified and Fuzzified General Problem Solver for the "Monkey and Banana" Problem. 1st Report, Modified General Problem Solver with Feedback Principle.

Neurosolver: Neuromorphic General Problem Solver

Most beautiful dreams of Artificial Intelligence are still unfulfilled, although some areas, for example Expert Systems, have made it through to the mainstream technology. In this paper, we propose a new approach to general problem solving that employs neuromorphic methods rather than these having their roots in formal logic. Our approach addresses many issues that are difficult to overcome in ...

Domain Problem Solver Layer Domain Problem Solver

A Problem-solver/tms Architecture for General Constraint Satisfaction Problems

Constraints, in various forms, are ubiquitous to design problems. In this paper, we provide a formal characterization of a generalized constraint satisfaction problem (CSP) that can be used to model many types of design/planning problems, and the architecture of an imlemented reasoning system for solving this problem. The architecture includes a truth maintenance system (TMS) which is specifica...

Assessing the computational adequacy of the General Problem Solver model

Problem solving is a core cognitive ability. Human performance varies widely in solving different types of problems. Ideally, cognitive models of problem solving should explain these variations in two ways: (1) the model should reproduce the sequences of actions applied by humans during problem solving (empirical adequacy), and (2) the time required by the model should match that required by hu...

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.